There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
نویسندگان
چکیده
منابع مشابه
There Are Ternary Circular Square-Free Words of Length n for n >= 18
There are circular square-free words of length n on three symbols for n ≥ 18. This proves a conjecture of R. J. Simpson.
متن کاملOn Ternary Square-free Circular Words
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths l except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the K3,3 graph. In addition, our proof implie...
متن کاملn-Letter Ternary Square-Free Words
Recently, Ekhad and Zeilberger [4] presented an improved lower bound for the “connective constant” of ternary square-free words. Their bound of 2 is proven by constructing a “Brinkhuis triple-pair” of length 18. By presenting a Brinkhuis triple-pair of length 17, we show that, within the same particular class of Brinkhuis triples, the optimal bound is actually 2. A square-free word w is a word ...
متن کاملUpper bound on the number of ternary square-free words
Let tn be the number of words of length n in a factorial language L. We adapt the transfert matrix method to obtain upper bounds on the growth rate of words in L defined as limn→∞ (tn) 1 n . This method is used to lower the best known upper bounds on the growth rate of ternary square-free words from 1.30193812.. to 1.30178858..
متن کاملImproved bounds on the number of ternary square-free words
Improved upper and lower bounds on the number of squarefree ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised Brinkhuis triples. The problem of finding such triples can essentially be reduced to a combinatorial problem, which can efficiently be treated by computer. In part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2002
ISSN: 1077-8926
DOI: 10.37236/1671